The untyped stack calculus and Bohm's theorem
نویسنده
چکیده
The stack calculus is a functional language in which is in a Curry-Howard correspondence with classical logic. It enjoys confluence but, as well as Parigot's λ µ, does not admit the Böhm Theorem, typical of the λ-calculus. We present a simple extension of stack calculus which is for the stack calculus what Saurin's Λµ is for λ µ.
منابع مشابه
SOME FUNDAMENTAL RESULTS ON FUZZY CALCULUS
In this paper, we study fuzzy calculus in two main branches differential and integral. Some rules for finding limit and $gH$-derivative of $gH$-difference, constant multiple of two fuzzy-valued functions are obtained and we also present fuzzy chain rule for calculating $gH$-derivative of a composite function. Two techniques namely, Leibniz's rule and integration by parts are introduced for ...
متن کاملλμ-calculus and Λμ-calculus: a Capital Difference
Since Parigot designed the λμ-calculus to algorithmically interpret classical natural deduction, several variants of λμ-calculus have been proposed. Some of these variants derived from an alteration of the original syntax due to de Groote, leading in particular to the Λμ-calculus of the second author, a calculus truly different from λμ-calculus since, in the untyped case, it provides a Böhm sep...
متن کاملGödelization in the Untyped lambda-Calculus
It is well-known that one cannot inside the pure untyped lambda calculus determine equivalence. I.e., one cannot determine if two terms are beta-equivalent, even if they both have normal forms. This implies that it is impossible in the pure untyped lambda calculus to do Godelisation, i.e. to write a function that can convert a term to a representation of (the normal form of) that term, as equi...
متن کاملOn the denotational semantics of the untyped lambda-mu calculus
Starting with the idea of reflexive objects in Selinger’s control categories, we define three different denotational models of Parigot’s untyped lambda-mu calculus. The first one is built from an intersection types system for the lambda-mu calculus leading to a generalization of Engeler’s model of the untyped lambda calculus. The second model introduces correlation spaces (coming from Girard’s ...
متن کاملRepresentation and duality of the untyped lambda-calculus in nominal lattice and topological semantics, with a proof of topological completeness
We give a semantics for the λ-calculus based on a topological duality theorem in nominal sets. A novel interpretation of λ is given in terms of adjoints, and λ-terms are interpreted absolutely as sets (no valuation is necessary).
متن کامل